OFDM networks with pseudo-random phase precoding

ABSTRACT

In an orthogonal frequency division multiplexing (OFDM) network, a set of pseudo random sequences (PRS) are stored at a transmitter and a receiver. Each OFDM symbol is mapped to subcarriers for a set of transmit antennas to produce a mapped symbol. The mapped symbol is encoded using a pseudo-random phase precoder (PRPP) and the PRS to produce a precoded symbol. An inverse fast Fourier transform (IFFT) is applied to the precoded symbol, and the encoded symbol is transmitted to the receiver using the set of transmit antennas.

FIELD OF THE INVENTION

This invention relates generally to the field of wireless communications, and more particularly to transmitting data in single-input and multiple-output (SIMO) networks and multiple-input and multiple-output (MIMO) networks with both narrowband and wideband modulation formats.

BACKGROUND OF THE INVENTION

Stations in wireless communication networks can be equipped with multiple antennas at transmitters and receivers to improve data rates and reliability. Wider transmission bandwidths increase capacity but lead to frequency-selective fading, and time-varying multipath fading due to station mobility and Doppler spread.

To cope with time-selective and frequency-selective fading, it is important to use transmission formats such as orthogonal frequency division multiplexing (OFDM), or single-carrier frequency division multiple access (SC-FDMA). In the context of multiuser cellular networks, OFDMA access in an uplink (UL) channel from mobile stations (MS) to a base station (BS) leads to interference avoidance for in-cell MS, and interference averaging for out-of-cell MS.

Due to cost, complexity and size reasons, the number of transmit/receive antennas in mobile stations is typically between 1 and 4, which makes exploitation of MIMO gains difficult. In the context of infrastructure-less networks, such as mobile ad hoc networks, with a single antenna at the MS, the overall network performance is significantly decreased on channels with little time and frequency selectivity due to lack of spatial diversity.

SUMMARY OF THE INVENTION

The embodiments of the invention provide methods for encoding and decoding data over SIMO and MIMO networks with superior reliability when compared to conventional networks, with no penalty on an overall data rate.

The encoding and decoding steps are described separately for both narrowband as well as wideband transmission cases. In particular, for the wideband case, the encoding and decoding procedures are optimized for both OFDM as well as SC-FDMA transmission formats.

The methods provide novel pseudo-random phase precoding (PRPP) at the transmitter, and a low-complexity data detection using an iterative likelihood search (ILS) procedure.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A is a block diagram of an OFDM transceiver according to embodiments of the invention:

FIG. 1B is a block diagram of a transmitter and a receiver for parallel fading channels in a SISO network according to embodiments of the invention;

FIG. 2 is a block diagram of a parallel MIMO network without pseudo-random phase precoding according to embodiments of the invention;

FIG. 3 is a block diagram of a parallel MIMO network with pseudo-random phase precoding according to embodiments of the invention;

FIG. 4 is a block diagram of a transmitter for an OFDMA network according to embodiments of the invention;

FIG. 5 is a block diagram of a receiver for an OFDMA network according to embodiments of the invention;

FIG. 6 is a block diagram for a transmitter for a SC-FDMA network according to embodiments of the invention; and

FIG. 7 is a block diagram for a receiver for a SC-FDMA network according to embodiments of the invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

The embodiments of our invention provide methods for encoding and decoding data in SIMO and MIMO networks.

FIG. 1A shows a network including a transmitter 110 and a receiver 120 according to embodiments of our invention. In the transmitter, a symbol (signal z(m)) is encoded 11, interleaved 12, mapped 13 to subcarriers, inverse fast Fourier transformed (IFFT) 14, a cyclic prefix is added before parallel-to-serial conversion 15, analog-to-digital converted 16, and transmitted on a channel 17 subject to noise, fading and interference, n(t), via a set of one or more transmit antennas.

In the receiver, the received signal y(t), via a set of one or more receive antennas 18, is analog-to-digital converted 22. Then, the signal is serial-to-parallel converted and the cyclic prefix is removed 23, fast Fourier transformed (FFT) 24, de-mapped 25, de-interleaved 26, and decoded 27 to estimate a signal {circumflex over (z)} (m).

Also, our transmitter includes a pseudo-random phase precoder (PRPP) 1 to precode symbols, and our receiver includes a low-complexity iterative likelihood search (ILS) procedure 2 to detect symbols. The PRPP and ILS share a set of pseudo-random sequences (PRS) 130.

Narrowband Single Input and Single Output (SISO) Networks:

We describe a narrowband transmission scenario in which the set of antennas at the transmitter has one transmit antenna, and the set of antennas at the receiver has one receive antenna.

As shown in FIG. 1B, we also describe a parallel fading channel model, where K channels are available for data transmission at channel use n.

The K channels can be K disjoint frequency bands, and the channel can be in a time domain. Alternatively, the K channels can be characterized as K disjoint time slots, and the channel use is in a frequency domain. When the channel use is in the time domain, and the number of channels is in the frequency domain, each of these K channels is assumed to be narrow-band.

We denote by U_(n)(k) a complex-valued modulation symbol 101 to be transmitted on channel k at time n. The corresponding decoded signals at the receiver are Û_(n)(k) 105. We use the set of PRS 130 that are shared between the transmitter and the receiver.

For a given PRS, a K-by-K pseudo-random phase precoding (PRPP) matrix W_(n), is used by the transmitter at time n. Here, the number of channels is K, the (p, q)^(th) element, where p denotes the row and q denotes the column index of W_(n), is exp(j*θ(p,q))/√{square root over (K)}, where θ(p, q) is the pseudo-randomly generated phase that is uniformly distributed between −π and π.

The output 102 of the PRPP at channel use n is denoted by X_(n)(1), X_(n)(2), . . . , X_(n)(K) 102. Using the matrix-vector notation, the output of the PRPP can be expressed as

${\underset{\_}{X}}_{n} = {{\underset{\_}{W}}_{n}{\underset{\_}{U}}_{n}}$ ${{where}\mspace{14mu}{\underset{\_}{X}}_{n}} = \left\lbrack {{X_{n}(1)},{X_{n\;}\;(2)},\ldots\mspace{14mu},{X_{n}(K)}} \right\rbrack^{T}$ ${\underset{\_}{W}}_{n} = {{\frac{1}{\sqrt{k}}\begin{bmatrix} {\mathbb{e}}^{j\;{\theta{({1,1})}}} & \ldots & {\mathbb{e}}^{j\;{\theta{({1,K})}}} \\ \vdots & \ddots & \vdots \\ {\mathbb{e}}^{j\;{\theta{({K,1})}}} & \ldots & {\mathbb{e}}^{j\;{\theta{({K,K})}}} \end{bmatrix}}.\;{and}}$ ${\underset{\_}{U}}_{n} = \left\lbrack {{U_{n}(1)},{U_{n}(2)},\ldots\mspace{14mu},{U_{n}(K)}} \right\rbrack^{T}$

The complex-valued channel gain on the k^(th) channel at time n is H_(n)(k) 103. The vector-valued received signal Y 104 is Y _(n) =H _(n) X _(n) +Z _(n) where

Y _(n)=[Y_(n)(1), Y_(n)(2), . . . , Y_(n)(K)]^(T)

H _(n)=diag([H_(n)(1), H_(n)(2), . . . , H_(n)(K)])

and Z_(n)=[Z_(n)(1), Z_(n)(2), . . . , Z_(n)(K)]^(T) is a noise vector.

Because X _(n)=W _(n) U _(n), the received signal Y _(n) is Y _(n) =H _(n) W _(n) U _(n) +Z _(n)  (1)

When the channel matrix H _(n) 103 is available at the receiver, in the absence of PRPP, or when W _(n)=I _(n), where I _(n) is the K-by-K identity matrix, each modulated symbol can be individually demodulated using

$\begin{matrix} {{R_{n}(k)} = {\frac{Y_{n}(k)}{H_{n}(k)} = {{U_{n}(k)} + {\frac{Z_{n}(k)}{H_{n}(k)}.}}}} & (2) \end{matrix}$

That is, there is no inter-channel interference (ICI) in the absence of PRPP. However, because each channel undergoes through only one fading random variable, the diversity order per channel, as well as the overall diversity order, are limited to unity. That is, the above described network without PRPP suffers from severe performance loss.

The PRPP deliberately introduces ICI. That is, the received signal on the k^(th) channel contains signal contributions not only from the k^(th) channel, but also from all other K−1 channels. The impact of this is that the above described single-tap equalization approach, namely,

$\begin{matrix} {{R_{n}(k)} = {\frac{Y_{n}(k)}{H_{n}(k)} = {{{{\underset{\_}{W}}_{n}\left( {k,k} \right)}{U_{n}(k)}} + {\sum\limits_{{j = 1},{j \neq k}}^{K}{{{\underset{\_}{W}}_{n}\left( {k,j} \right)}{U_{n}(j)}}} + \frac{Z_{n}(k)}{H_{n}(k)}}}} & (3) \end{matrix}$ leads to severe inter-symbol interference.

To improve the performance of PRPP network, we can use maximum-likelihood (ML) detection. The ML approach is essentially a joint detection approach, and has the following form

$\begin{matrix} {{{\underset{\_}{U}}_{n}^{ML} = {\underset{{\underset{\_}{U}}_{n}}{\arg\;\min}\left( {{\underset{\_}{Y}}_{n} - {{\underset{\_}{H}}_{n}{\underset{\_}{W}}_{n}{\underset{\_}{U}}_{n}}} \right)^{Herm}{\Psi_{Z}^{- 1}\left( {{\underset{\_}{Y}}_{n} - {{\underset{\_}{H}}_{n}{\underset{\_}{W}}_{n}{\underset{\_}{U}}_{n}}} \right)}}},} & (4) \end{matrix}$ where Ψ_(Z) is a covariance matrix of a noise random vector Z _(n), and Herm is the Hermitian transpose operator. The ML approach searches over all possible vector-valued symbols, U _(n), to determine an optimal vector. However, the ML approach has a search complexity of the order of (size (U_(n)(k)))^(K), where size (U_(n)(k)) is the constellation size of the modulation symbol U_(n)(k), which is prohibitively high even for values of K between 10 and 20.

Some of the sub-optimum approaches to obtain an estimate of U _(n) are:

-   -   Using a matched filter (MF) receiver     -   using a linear minimum mean-square error (LMMSE) receiver;     -   using a zero-forcing (ZF) receiver; and     -   using a LMMSE or ZF receiver with, possibly ordered, successive         interference cancellation (SIC) techniques.

We describe a reduced complexity detection procedure for the PRPP transmission method according to embodiments of the invention. This detection procedure is the iterative likelihood search (ILS) procedure 2. Note that the ILS procedure described here is similar to the procedure described by Mohammed et al, “Low-complexity detection and performance in multi-gigabit high spectral efficiency wireless systems,” in IEEE PIMRC, September 2008, in the context of a narrow-band MIMO network with a large number of antennas at the transmitter as well as at the receiver.

The following are the steps in the ILS procedure.

-   -   a) We assume that the receiver has the noise covariance matrix         Ψ_(Z). If Ψ_(Z) is not known at the receiver, then set Ψ_(Z)=I         _(n), the identity matrix.     -   b) We define the noise weighed received signal as O _(n)=Ψ_(Z)         ^(−1/2) Y _(n),     -   c) The effective channel matrix is G _(n)=Ψ_(Z) ^(−1/2) Ĥ _(n) W         _(n) where Ĥ _(n) is the channel estimate at the receiver.

Using Steps a), b) and c) The equivalent vector-valued received signal is O _(n) =G _(n) U _(n) +Z _(n,white),  (5) where Z _(n,white)=Ψ_(Z) ^(−1/2) Z _(n) is a whitened noise random vector.

When the modulation symbols U_(n)(k) are drawn from a complex-valued constellation, such as quadrature phase shift keying (QPSK) or quadrature amplitude modulations (QAM)), The equivalent real-valued version of Equation (5) is

$\begin{matrix} {{{{\underset{\_}{O}}_{{Re},n} = {{{\underset{\_}{G}}_{{Re},n}{\underset{\_}{U}}_{{Re},n}} + {\underset{\_}{Z}}_{{Re},n}}},{where}}{{\underset{\_}{O}}_{{Re},n} = \begin{bmatrix} {{Re}\left( {\underset{\_}{O}}_{n} \right)} \\ {{Im}\left( {\underset{\_}{O}}_{n} \right)} \end{bmatrix}}{{\underset{\_}{G}}_{{Re},n} = \begin{bmatrix} {{Re}\left( {\underset{\_}{G}}_{n} \right)} & {- {{Im}\left( {\underset{\_}{G}}_{n} \right)}} \\ {{Im}\left( {\underset{\_}{G}}_{n} \right)} & {{Re}\left( {\underset{\_}{G}}_{n} \right)} \end{bmatrix}}{{\underset{\_}{U}}_{{Re},n} = \begin{bmatrix} {{Re}\left( {\underset{\_}{U}}_{n} \right)} \\ {{Im}\left( {\underset{\_}{U}}_{n\;} \right)} \end{bmatrix}}{{{\underset{\_}{Z}}_{{Re},n} = \begin{bmatrix} {{Re}\left( {\underset{\_}{Z}}_{n,{White}} \right)} \\ {{Im}\left( {\underset{\_}{Z}}_{n,\;{White}} \right)} \end{bmatrix}},}} & (6) \end{matrix}$ where Re and Im denote real and imaginary components.

When the modulation symbols U_(n) (k) are drawn from a real-valued binary constellation, we have

$\begin{matrix} {{{{\underset{\_}{O}}_{{Re},n} = {{{\underset{\_}{G}}_{{Re},n}{\underset{\_}{U}}_{{Re},n}} + {\underset{\_}{Z}}_{{Re},n}}},{where}}{{\underset{\_}{O}}_{{Re},n} = \begin{bmatrix} {{Re}\left( {\underset{\_}{O}}_{n} \right)} \\ {{Im}\left( {\underset{\_}{O}}_{n\;} \right)} \end{bmatrix}}{{\underset{\_}{G}}_{{Re},n} = \begin{bmatrix} {{Re}\left( {\underset{\_}{G}}_{n} \right)} \\ {{Im}\left( {\underset{\_}{G}}_{n} \right)} \end{bmatrix}}{{\underset{\_}{U}}_{{Re},n} = {{Re}\left( {\underset{\_}{U}}_{n} \right)}}{{\underset{\_}{Z}}_{{Re},n} = {\begin{bmatrix} {{Re}\left( {\underset{\_}{Z}}_{n,{White}} \right)} \\ {{Im}\left( {\underset{\_}{Z}}_{n,{White}} \right)} \end{bmatrix}.}}} & (7) \end{matrix}$

The detailed ILS procedure steps are as follows.

We denote by Û _(Re,n) (i) an estimate of U _(Re,n) at the end of i^(th) iteration. Denote

${\underset{\_}{R}}_{G,n} = {{{\underset{\_}{G}}_{{Re},n}^{T}{\underset{\_}{G}}_{{Re},n}} = \left\{ {{\begin{matrix} \begin{matrix} \left\lfloor {{\underset{\_}{r}}_{G,n}(1)} \right. & \ldots & \left. {r_{G,n}(K)} \right\rfloor \end{matrix} & {{for}\mspace{14mu}{BPSK}\mspace{14mu}{inputs}} \\ \begin{matrix} \left\lbrack {{\underset{\_}{r}}_{G,n}(1)} \right. & \ldots & \left. {r_{G,n}\left( {2K} \right)} \right\rbrack \end{matrix} & {{{for}\mspace{14mu}{QPSK}\mspace{14mu}{and}\mspace{14mu}{QAM}\mspace{14mu}{inputs}}\mspace{14mu}} \end{matrix}\mspace{79mu}{and}\mspace{14mu}{\omega_{G,n}(i)}} = {{{\underset{\_}{R}}_{G,n}\left( {i,i} \right)}.}} \right.}$

The initial estimate of U _(Re,n), Û _(Re,n) (0) is set as the output of the LMMSE detector. That is, Û _(Re,n)(0)=( G _(Re,n) ^(T) G _(Re,n) +λI )⁻¹ G _(Re,n) ^(T) O _(Re,n)  (8) where λ is an appropriate diagonal loading factor that can be set to a fixed number, or can be adaptively varied. By setting λ=0, the initial vector corresponding to the ZF detector can be obtained.

For k=1: Number_Iterations

${\left. {{{\left. {{{{\left. {{{\left. a \right)\mspace{14mu}{\underset{\_}{z}}^{k}} = {G_{{Re},n}^{T}\left( {{\underset{\_}{O}}_{{Re},n} - {{\underset{\_}{G}}_{{Re},n}{{\underset{\_}{\hat{U}}}_{{Re},n}(k)}}} \right)}}b} \right)\mspace{14mu} z_{p}^{k}} = {{{{\underset{\_}{z}}^{k}(p)}.\mspace{14mu}{That}}\mspace{14mu}{is}}},{z_{p}^{k}\mspace{14mu}{is}\mspace{14mu}{the}\mspace{14mu} p^{th}\mspace{14mu}{element}\mspace{14mu}{of}\mspace{14mu}{\underset{\_}{z}}^{k}}}c} \right)\mspace{14mu} s} = {\underset{p}{\arg\;\min}\left( {{\left( l_{p,{opt}}^{k} \right)^{2}{\omega_{G,n}(p)}} - {2l_{p,{opt}}^{k}{z_{p}^{k}}}} \right)}}d} \right)\mspace{14mu}{If}\mspace{14mu}\left( l_{s,{opt}}^{k} \right)^{2}{\omega_{G,n}(s)}} < {2l_{s,{opt}}^{k}\;{z_{s}^{k}}}$ ${{i.\mspace{14mu}{\underset{\_}{\hat{U}}}_{{Re},n}}\;\left( {k + 1} \right)} = {{{\underset{\_}{\hat{U}}}_{{Re},n}(k)} + {l_{s,{opt}}^{k}{{sgn}\left( z_{s}^{k} \right)}{\underset{\_}{e}}_{s}}}$ ${{ii}.\mspace{14mu}{\underset{\_}{z}}^{k + 1}} = {{\underset{\_}{z}}^{k} - {l_{s,{opt}}^{k}{{sgn}\left( z_{s}^{k} \right)}{\underset{\_}{R}}_{G,n,s}}}$

Else

Terminate the search.

Declare Û _(Re,n)(k) as the detected data vector

Note that e _(s) in Step 3), D.i is a unit vector with its s^(th) entry only as one, and all the other entries as zero, and R _(G,n,s) in Step 3) D.ii is the s^(th) column of the matrix R _(G,n).

In the above ILS procedure, Number_Iterations is the number of iterations, which can be set to a fixed value, or can be varied adaptively depending upon the noise and interference conditions.

We note that the above described ILS procedure produces hard-outputs of the modulation symbols U_(n)(k). However, various other procedures, listed below, can as well be used to produce soft-estimates (or reliability values) of U_(n)(k) in the above described PRPP-based invention: J. Luo, K. Pattipati, P. Willett and F. Hasegawa, “Near-optimal multiuser detection in synchronous CDMA using probabilistic data association,” in IEEE Communications Letters, vol. 5, no. 9, pp. 361-363, September 2001; Y. Huang and J. Zhang, “Generalized probabilistic data association multiuser detection,” in Proc. IEEE ICC'2004, June-July 2004; P. H. Tan and L. K. Rasmussen, “Multiuser detection in CDMA—A comparison of relaxation, exact and heuristic search methods,” in IEEE Transactions on Wireless Communications, vol. 3, no. 5, pp. 1802-1809, September 2004; D. Pham, K. Pattipati, P. Willett and J. Luo, “A generalized probabilistic data association detector for multi antenna systems,” in IEEE Communications Letters, vol. 8, no. 4, pp. 205-207, April 2004; P. H. Tan and L. K. Rasmussen, “Asymptotically optimal nonlinear MMSE multiuser detection based on multivariate Gaussian approximation,” in IEEE Transactions on Communications, vol. 54, no. 8, pp. 1427-1438, August 2006; Y. Jia, C. M. Vithanage, C. Andreiu and R. J. Piechocki, “Probabilistic data association for symbol detection in MIMO systems,” in IEE Electronic Letters, vol. 42, no. 1, 5 Jan. 2006; H. Zhao, L. Tong and W. Wang, “Tabu search detection for MIMO systems,” in IEEE PIMRC'2007, September 2007; N. Srinidhi, S. K. Mohammed, A. Chockalingam and B. Sunder Rajan, “Low-complexity near-ML decoding of large non-orthogonal STBCs using reactive tabu search,” in Proc. IEEE ISIT'2009, June-July 2009.

Note that all the above mentioned references do not employ PRPP in their networks. Note also that the prior art MIMO networks described in the above references typically requires a large number of transmit and receiver antennas to achieve the desired performance gains. In contrast, the PRPP method and network according to embodiments of invention combine time and/or frequency resources while using a substantially smaller number of transmit and receiver antennas. By concurrently exploiting time and/or frequency resources, performance gains can still be obtained in transceivers with only a single transmit or receive antenna. Whereas the prior art networks cannot provide any performance improvement with transceivers that only have one transmit and one receiver antenna.

Narrowband Multiple Input and Multiple Output (MIMO) Networks:

FIG. 2 shows a transmitter 210 with a set of N_(T) transmit antennas, and a receiver 220 with a set of N_(R) receive antennas and MIMO receivers 221 in a MIMO network using K channels 215 without PRPP. The narrowband version of the PRPP transmitter and ILS-based received is described as follows.

The number of spatial streams with the N_(T) transmit antennas is N_(S). Note that N_(S)≦N_(T). Let Q _(n)(k) denote the mapping 13 from the number of streams to the number of transmit antennas at time n on channel k. Note that Q _(n)(k) is a matrix of size N_(T)-by-N_(S).

FIG. 3 shows a similar configuration but for a transmitter 310 with PRPP, and a receiver 320 with ILS.

Following the same model as described in above, in the absence of PRPP at the transmitter, the received signal model on k^(th) channel at time n is Y _(n)(k)= H _(n)(k) Q _(n)(k) U _(n)(k)+ Z _(n)(k).  (9)

In the Equation (9), Y _(n)(k) and Z _(n)(k) are of size N_(R)-by-1, H _(n)(k) is of size N_(R)-by-N_(T) and U _(n)(k) is of size N_(S)-by-1.

Now, we apply the PRPP matrix W _(n) of size N_(S)K-by-N_(S)K in the following manner

${\underset{\_}{X}}_{n} = {{\underset{\_}{W}}_{n}{\underset{\_}{U}}_{n}}$ where ${\underset{\_}{X}}_{n} = \left\lbrack {{X_{n}\left( {1,1} \right)},\ldots\mspace{14mu},{X_{n}\;\left( {1,N_{S}} \right)},\ldots\mspace{14mu},{X_{n}\left( {K,1} \right)},\ldots\mspace{14mu},{X_{n}\left( {K,N_{S}} \right)}} \right\rbrack^{T}$ ${\underset{\_}{W}}_{n} = {\frac{1}{\sqrt{N_{S}K}}\begin{bmatrix} {\mathbb{e}}^{j\;{\theta{({1,1})}}} & \ldots & {\mathbb{e}}^{j\;{\theta{({1,{N_{S}K}})}}} \\ \vdots & \ddots & \vdots \\ {\mathbb{e}}^{j\;{\theta{({{N_{S}K},1})}}} & \ldots & {\mathbb{e}}^{j\;{\theta{({{N_{S}K},{N_{S}K}})}}} \end{bmatrix}}$ and ${\underset{\_}{U}}_{n} = {\left\lbrack {{U_{n}\left( {1,1} \right)},\ldots\mspace{14mu},{U_{n}\left( {1,N_{S}} \right)},\ldots\mspace{14mu},{U_{n}\left( {K,1} \right)},\ldots\mspace{14mu},{U_{n}\left( {K,N_{S}} \right)}} \right\rbrack^{T}.}$

The equivalent received signal over K channels, each with N_(R) receive antennas, is

$\begin{matrix} {{{\underset{\_}{Y}}_{n} = {{{\underset{\_}{H}}_{n}{\underset{\_}{W}}_{n\;}{\underset{\_}{U}}_{n}} + {\underset{\_}{Z}}_{n}}}{where}{{\underset{\_}{Y}}_{n} = \begin{bmatrix} {{\underset{\_}{Y}}_{n}(1)} \\ \vdots \\ {{\underset{\_}{Y}}_{n}(K)} \end{bmatrix}}{{\underset{\_}{H}}_{n} = {{diag}\left( \left\lbrack {{{\underset{\_}{H}}_{n}(1)}{{\underset{\_}{Q}}_{n}(1)}\mspace{14mu}\ldots\mspace{14mu}{{\underset{\_}{H}}_{n}(K)}{{\underset{\_}{Q}}_{n}(K)}} \right\rbrack \right)}}{{\underset{\_}{Z}}_{n} = {\begin{bmatrix} {{\underset{\_}{Z}}_{n}\;(1)} \\ \vdots \\ {{\underset{\_}{Z}}_{n}(K)} \end{bmatrix}.}}} & (10) \end{matrix}$

Because the form of Equation (10) is very similar to the form of Equation (1), we use the ILS procedure 2 to detect the data symbol vector U _(n). We can also use the Tabu search (TS), reactive Tabu search (RTS) or probabilistic data association (PDA), procedures referenced above, to provide soft-estimates of the symbol vector U _(n).

Wideband MIMO Networks Using OFDMA:

The transmitter for the PRPP based OFDMA network is shown in FIG. 4. The transmitter includes the PRPP 1 using the set of PRS 130, the N point inverse fast Fourier transform IFFT) 14, the block 15 to add the cyclic prefix and convert to serial, and the D/A and RF converter 16.

FIG. 5 shows the corresponding receiver where the blocks 22, 23, and 24 perform the inverse function of the corresponding blocks in FIG. 4, and the ILS-based detection procedure 2.

For simplicity, FIGS. 4 and 5 describe the SISO case. We can use the ideas of MIMO, as shown in FIGS. 2 and 3, to extend this network to support sets of multiple transmit and receive antennas.

The OFDMA network has N_(F) subcarriers, the set of N_(R) receiver antennas, and the set of N_(T) transmitter antennas. It is a usual practice that the cyclic prefix length is selected to be larger than the maximum delay spread of the channel, and the OFDM symbol duration is made smaller than the channel coherence time so that inter-symbol interference as well as inter-carrier interference are avoided.

The received vector valued signal on the k^(th) subcarrier for OFDM symbol n is Y _(n)(k)= H _(n)(k) Q _(n)(k) U _(n)(k)+ Z _(n)(k),  (11) where, the (i,j)^(th) entry of the channel matrix H _(n)(k) is the channel response from j^(th) transmit antenna to the i^(th) receive antenna on subcarrier k of the OFDM symbol n and Q _(n)(k) is the stream-to-antenna mapping matrix on subcarrier k of the OFDM symbol n.

The PRPP matrix W _(n) at the transmitter for the OFDMA network is

$\mspace{79mu}{{\underset{\_}{X}}_{n} = {{\underset{\_}{W}}_{n}{\underset{\_}{U}}_{n}}}$   where ${\underset{\_}{X}}_{n} = \left\lbrack {{X_{n}\left( {1,1} \right)},\ldots\mspace{14mu},{X_{n}\left( {1,N_{S}} \right)},\ldots\mspace{14mu},{X_{n}\left( {N_{F},1} \right)},\ldots\mspace{14mu},{X_{n}\left( {N_{F},N_{S}} \right)}} \right\rbrack^{T}$ $\mspace{20mu}{{\underset{\_}{W}}_{n} = {\frac{1}{\sqrt{N_{S}N_{F}}}\begin{bmatrix} {\mathbb{e}}^{{j\theta}\;{({1,1})}} & \ldots & {\mathbb{e}}^{j\;{\theta{({1,N_{S},N_{F}})}}} \\ \vdots & \ddots & \vdots \\ {\mathbb{e}}^{j\;{\theta{({{N_{S}N_{F}},1})}}} & \ldots & {\mathbb{e}}^{j\;{\theta{({{N_{S}N_{F}},{N_{S}N_{F}}})}}} \end{bmatrix}}}$   and ${\underset{\_}{U}}_{n} = {\left\lbrack {{U_{n}\left( {1,1} \right)},\ldots\mspace{14mu},{U_{n}\left( {1,N_{S}} \right)},\ldots\mspace{14mu},{U_{n}\left( {N_{F},1} \right)},\ldots\mspace{14mu},{U_{n}\left( {N_{F},N_{S}} \right)}} \right\rbrack^{T}.}$

Note that N_(F) is the number of subcarriers over which the PRPP matrix is applied and N_(F) is a configurable parameter depending upon the channel conditions and receiver capabilities.

The equivalent received signal over N_(F) channels at the set of N_(R) receive antennas is

$\begin{matrix} {{{\underset{\_}{Y}}_{n} = {{{\underset{\_}{H}}_{n}{\underset{\_}{W}}_{n}{\underset{\_}{U}}_{n}} + {\underset{\_}{Z}}_{n}}}{where}{{\underset{\_}{Y}}_{n} = \begin{bmatrix} {{\underset{\_}{Y}}_{n}(1)} \\ \vdots \\ {{\underset{\_}{Y}}_{n}\left( N_{F} \right)} \end{bmatrix}}{{\underset{\_}{H}}_{n} = {{diag}\left( \left\lbrack {{{\underset{\_}{H}}_{n}(1)}{{\underset{\_}{Q}}_{n}(1)}\mspace{14mu}\ldots\mspace{14mu}{{\underset{\_}{H}}_{n}\left( N_{F}\; \right)}{{\underset{\_}{Q}}_{n}\left( N_{F}\; \right)}} \right\rbrack \right)}}{{\underset{\_}{Z}}_{n} = {\begin{bmatrix} {{\underset{\_}{Z}}_{n}(1)} \\ \vdots \\ {{\underset{\_}{Z}}_{n}\left( N_{F} \right)} \end{bmatrix}.}}} & (12) \end{matrix}$

Because the form of Equation (12) is very similar to the form of Equation (1), we can use the ILS procedure 2 for the wideband OFDMA network of FIGS. 2 and 3 to detect the data symbol vector U _(n).

Wideband MIMO Networks Using SC-FDMA:

FIG. 6 shows a single-carrier FDMA (SC-FDMA) transmitter with the PRPP 1.

FIG. 7 shows the SC-FDMA receiver that utilizes the ILS procedure 2 for data detection. For simplicity, FIGS. 6 and 7 describe the SISO case. We can use the ideas of MIMO, as shown in FIGS. 2 and 3 to extend this network to support sets of multiple transmit and receive antennas.

The SC-FDMA is frequently called a DFT-precoded OFDM network. The SC-FDMA is often used to reduce the peak-to-average power ratio problem associated with the OFDM modulation. In the SC-FDMA network without PRPP, a station uses a K-point DFT on the data sequence prior to modulation on the OFDM subcarriers. Although the number of subcarriers available for transmission, N, can be large, the configurable value of K can be based on channel conditions and other needs.

The SC-FDMA network has the set of N_(R) receiver antennas, and the set of N_(T) transmitter antennas. For now, we ignore the inter-symbol as well as inter-carrier interference. For this network, the K-length data vector on a transmit antenna/for OFDM symbol n is U _(l,n) =[U _(l,n)(1), U _(l,n)(2), . . . , U _(l,n)(K)]^(T).

The K-by-K PRPP matrix applied on transmit antenna l for OFDM symbol n is

${\underset{\_}{W}}_{l,n} = {{\frac{1}{\sqrt{K}}\begin{bmatrix} {\mathbb{e}}^{j\;{\theta_{l,n}{({1,1})}}} & \ldots & {\mathbb{e}}^{j\;{\theta_{l,n}{({1,K})}}} \\ \vdots & \ddots & \vdots \\ {\mathbb{e}}^{j\;{\theta_{l,n}{({K,1})}}} & \ldots & {\mathbb{e}}^{j\;{\theta_{l,n}{({K,K})}}} \end{bmatrix}}.}$

The PRPP signal at the output of the transmit antenna l is X _(l,n) =W _(l,n) F U _(l,n).

The N_(R)K-by-1 received signal at the output of FFT, with PRPP, is

$\begin{matrix} \begin{matrix} {{\underset{\_}{Y}}_{n} = {{\sum\limits_{l = 1}^{N_{T}}{{\underset{\_}{H}}_{l,n}{\underset{\_}{X}}_{l,n}}} + {\underset{\_}{Z}}_{n}}} \\ {= {{\begin{bmatrix} {\underset{\_}{H}}_{1,n} & \ldots & {\underset{\_}{H}}_{N_{T},n} \end{bmatrix}\begin{bmatrix} {\underset{\_}{X}}_{1,n} \\ \vdots \\ {\underset{\_}{X}}_{1,n} \end{bmatrix}} + {\underset{\_}{Z}}_{n}}} \\ {= {{{\underset{\_}{H}}_{n}{\underset{\_}{X}}_{n}} + {{\underset{\_}{Z}}_{n}.}}} \end{matrix} & (13) \end{matrix}$

Because the form of Equation (13) is very similar to the form of Equation (1), we can use the ILS procedure 2 described in for the wideband SC-FDMA network of FIGS. 4 and 5 to detect the data symbol vector U _(n).

Although the invention has been described by way of examples of preferred embodiments, it is to be understood that various other adaptations and modifications may be made within the spirit and scope of the invention. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention. 

1. A method for communicating symbols in a network including a transmitter and a receiver, wherein the network uses orthogonal frequency division multiplexing (OFDM), wherein the transmitter has a set of transmit antenna, and wherein the receiver has a set of receive antennas, comprising: storing a set of pseudo random sequences (PRS) at the transmitter and the receiver; mapping each symbol to subcarriers for the set of transmit antennas to produce a mapped symbol; encoding the mapped symbol using a pseudo-random phase precoder (PRPP) and the PRS to produce a precoded symbol, wherein the PRPP uses a K-by-K pseudo-random phase precoding (PRPP) matrix W_(n) at time n, where a number of channels is K, p denotes a row index and q denotes a column index of the matrix W_(n), and an element (p, q) in the matrix W_(n) is exp(j*θ(p, q))/√{square root over (K)}, where θ(p, q) is a pseudo-randomly phase generated by the PRS uniformly distributed between −π and π; applying an inverse fast Fourier transform (IFFT) to the precoded symbol; and transmitting the encoded symbol to the receiver using the set of transmit antennas.
 2. The method of claim 1, wherein the network is a single-input and multiple-output (SIMO) network.
 3. The method of claim 1, wherein the network is a multiple-input and multiple-output (MIMO) network.
 4. The method of claim 1, further comprising: receiving the encoded symbol at the set of receive antennas; applying a fast Fourier transform to the received symbol to produce a transformed symbol; applying an iterative likelihood search (ILS) procedure to the transformed symbol using the PRS to produce a detected symbol; de-mapping the detected symbol.
 5. The method of claim 1, wherein the PRPP deliberately introduces inter-channel interference.
 6. The method of claim 1, wherein the receiver is a linear minimum mean-square error (LMMSE) receiver.
 7. The method of claim 1, wherein the receiver is a zero-forcing (ZF) receiver.
 8. The method of claim 6, wherein the receiver is the LMMSE receiver uses ordered successive interference cancellation (SIC) techniques.
 9. The method of claim 6, wherein the receiver is a matched-filter receiver.
 10. The method of claim 6, where the receiver uses a tabu search procedure with the LMMSE as an initial vector.
 11. The method of claim 7, where the receiver is a tabu search procedure with the ZF as an initial vector.
 12. The method of claim 1, where the receiver uses a tabu search procedure with matched-filter as an initial vector.
 13. The method of claim 6, where the receiver uses a reactive tabu search procedure with the LMMSE as an initial vector.
 14. The method of claim 7, where the receiver uses a reactive tabu search procedure with the ZF as an initial vector.
 15. The method of claim 1, where the receiver uses a reactive tabu search procedure with matched-filter as an initial vector.
 16. The method of claim 6, where the receiver uses a generalized probabilistic data association (GPDA) procedure with the LMMSE as the initial vector.
 17. The method of claim 16, where the receiver uses the GPDA procedure zero forcing as the initial vector.
 18. The method of claim 16, where the receiver uses the a GPDA procedure with matched-filter as the initial vector. 